GATE CSE 1996
Q21.
The correct matching for the following pairs is \begin{array}{ll|ll} \text{(A)}&\text{Activation record} & \text{(1)} &\text{Linking loader} \\ \text{(B)} &\text{Location counter} & \text{(2)} &\text{Garbage collection} \\ \text{(C)}& \text{Reference counts} & \text{(3)} &\text{Subroutine call} \\ \text{(D)}& \text{Address relocation} & \text{(4)}& \text{Assembler} \\ \end{array}Q22.
A ROM is used to store the table for multiplication of two 8-bit unsigned integers. The size of ROM required isQ25.
Consider the following statements: (i). First-in-first out types of computations are efficiently supported by STACKS. (ii). Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. (iii). Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. (iv). Last-in-first-out type of computations are efficiently supported by QUEUES.Q26.
The recurrence relation T(1) = 2 T(n) = 3T (\frac{n}{4}) +n has the solution T(n) equal toQ27.
Let L \subseteq \Sigma^* where \Sigma = \left\{a,b \right\}. Which of the following is true?Q28.
Let R be a non-empty relation on a collection of sets defined by _{A}R_ B if and only if A \cap B = \phi. Then, (pick the true statement)Q29.
Which two of the following four regular expressions are equivalent? (\varepsilon is the empty string). (i). (00)^ * (\varepsilon +0) (ii). (00)^* (iii). 0^* (iv). 0(00)^*Q30.
Let X = \{2, 3, 6, 12, 24\}, Let \leq be the partial order defined by X \leq Y if x divides y. Number of edges in the Hasse diagram of (X, \leq) is